Minimization Principle for Linear Response Eigenvalue Problem with Applications
نویسندگان
چکیده
We present a minimization principle for the sum of the first few smallest positive eigenvalues and Cauchy-like interlacing inequalities for the linear response eigenvalue problem arising from the calculation of excitation states of many-particle systems, a hot topic among computational material scientists today for materials design to advance energy science. Subsequently, we develop the best approximations of these smallest positive eigenvalues by a structure-preserving subspace projection. Based on these newly established theoretical results, we outline conjugate gradient-like algorithms for simultaneously computing the first few smallest positive eigenvalues and associated eigenvectors. Finally, we present numerical examples to illustrate essential convergence behaviors of the proposed conjugate gradient-like methods with and without preconditioning. 2000 Mathematics Subject Classification. Primary 65L15. Secondary 15A18, 81Q15
منابع مشابه
Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
We present two theoretical results for the linear response eigenvalue problem. The first result is a minimization principle for the sum of the smallest eigenvalues with the positive sign. The second result is Cauchy-like interlacing inequalities. Although the linear response eigenvalue problem is a nonsymmetric eigenvalue problem, these results mirror the well-known trace minimization principle...
متن کاملA NEW APPROACH TO THE SOLUTION OF SENSITIVITY MINIMIZATION IN LINEAR STATE FEEDBACK CONTROL
In this paper, it is shown that by exploiting the explicit parametric state feedback solution, it is feasible to obtain the ultimate solution to minimum sensitivity problem. A numerical algorithm for construction of a robust state feedback in eigenvalue assignment problem for a controllable linear system is presented. By using a generalized parametric vector companion form, the problem of eigen...
متن کاملMinimization Principles for the Linear Response Eigenvalue Problem II: Computation
In Part I of this paper we presented a minimization principle and related theoretical results for the linear response eigenvalue problem. Here we develop best approximations of the smallest few positive eigenvalues via a structure-preserving subspace projection. Then we present a four-dimensional subspace search conjugate gradient-like algorithm for simultaneously computing these eigenvalues an...
متن کاملMinimization principles and computation for the generalized linear response eigenvalue problem
The minimization principle and Cauchy-like interlacing inequalities for the generalized linear response eigenvalue problem are presented. Based on these theoretical results, the best approximations through structure-preserving subspace projection and a locally optimal block conjugate gradient-like algorithm for simultaneously computing the first few smallest eigenvalues with the positive sign a...
متن کاملMinimization Principles for the Linear Response Eigenvalue Problem III: General Case
Previously a minimization principle for the sum of the first few smallest eigenvalues with the positive sign and Cauchy-like interlacing inequalities for the standard linear response eigenvalue problem for the 2n×2n matrix [ 0 K M 0 ] were obtained by the authors, where K and M are n×n real symmetric positive semi-definite matrices and one of them is definite. In this paper, a more general line...
متن کامل